An algorithmic proof of the polyhedral decomposition theorem
نویسندگان
چکیده
منابع مشابه
An algorithmic proof of Brégman-Minc theorem
This article may be used for research, teaching and private study purposes. Any substantial or systematic reproduction, redistribution , reselling , loan or sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to da...
متن کاملDesigning an Algorithmic Proof of the Two-Squares Theorem
We show a new and constructive proof of the two-squares theorem, based on a somewhat unusual, but very effective, way of rewriting the so-called extended Euclid’s algorithm. Rather than simply verifying the result — as it is usually done in the mathematical community — we use Euclid’s algorithm as an interface to investigate which numbers can be written as sums of two positive squares. The prec...
متن کاملAn Algorithmic Proof of Suslin’s Stability Theorem over Polynomial Rings
Let k be a field. Then Gaussian elimination over k and the Euclidean division algorithm for the univariate polynomial ring k[x] allow us to write any matrix in SLn(k) or SLn(k[x]), n ≥ 2, as a product of elementary matrices. Suslin’s stability theorem states that the same is true for the multivariate polynomial ring SLn(k[x1, . . . , xm]) with n ≥ 3. As Gaussian elimination gives us an algorith...
متن کاملEliminating Human Insight: An Algorithmic Proof of Stembridge's TSPP Theorem
We present a new proof of Stembridge’s theorem about the enumeration of totally symmetric plane partitions using the methodology suggested in the recent Koutschan-Kauers-Zeilberger semi-rigorous proof of the Andrews-Robbins q-TSPP conjecture. Our proof makes heavy use of computer algebra and is completely automatic. We describe new methods that make the computations feasible in the first place....
متن کاملA simple proof of Kashin’s decomposition theorem∗†
Compressive Sensing techniques are used in a short proof of Kashin’s decomposition theorem generalized to `p-spaces for p ≤ 1. The proof is based on the observation that the null-space of a properly-sized matrix with restricted isometry property is almost Euclidean when endowed with the `p-quasinorm. Kashin’s decomposition theorem states that, for any integer m ≥ 1, `2m 1 is the orthogonal sum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Naval Research Logistics
سال: 1988
ISSN: 0894-069X,1520-6750
DOI: 10.1002/1520-6750(198810)35:5<463::aid-nav3220350510>3.0.co;2-5